Canonical derivatives, partial derivatives and finite automaton constructions
نویسندگان
چکیده
منابع مشابه
Canonical derivatives, partial derivatives and finite automaton constructions
Let E be a regular expression. Our aim is to establish a theoretical relation between two well-known automata recognizing the language of E, namely the position automaton PE constructed by Glushkov or McNaughton and Yamada, and the equation automaton EE constructed by Mirkin or Antimirov. We define the notion of c-derivative (for canonical derivative) of a regular expression E and show that if ...
متن کاملPartial Derivatives of Regular Expressions and Finite Automaton Constructions
We introduce a notion of partial derivative of a regular expression and apply it to finite automaton constructions. The notion is a generalization of the known notion of word derivative due to Brzozowski: partial derivatives are related to non-deterministic finite automata (NFA’s) in the same natural way as derivatives are related to deterministic ones (DFA’s). We give a constructive definition...
متن کاملDerivatives and Partial Derivatives for Regular Shuffle Expressions
There is a rich variety of shuffling operations ranging from asynchronous interleaving to various forms of synchronizations. We introduce a general shuffling operation which subsumes earlier forms of shuffling. We further extend the notion of a Brzozowski derivative and a Antimirov partial derivative to the general shuffling operation and thus to many earlier forms of shuffling. This extension ...
متن کاملCombinatorics of Partial Derivatives
The natural forms of the Leibniz rule for the kth derivative of a product and of Faà di Bruno’s formula for the kth derivative of a composition involve the differential operator ∂/∂x1 · · · ∂xk rather than dk/dxk, with no assumptions about whether the variables x1, . . . , xk are all distinct, or all identical, or partitioned into several distinguishable classes of indistinguishable variables. ...
متن کاملHamming polynomials and their partial derivatives
Hamming graphs are Cartesian products of complete graphs and partial Hamming graphs are their isometric subgraphs. The Hamming polynomial h(G) of a graph G is introduced as the Hamming subgraphs counting polynomial. Kk-derivates ∂kG (k ≥ 2) of a partial Hamming graph are also introduced. It is proved that for a partial Hamming graph G, ∂h(G) ∂xk = h(∂kG). A couple of combinatorial identities in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00267-5